Case-based Reasoning for Course Timetabling Problems
نویسنده
چکیده
........................................................................................................7 Acknowledgements.......................................................................................9 Table of Content ...........................................................................................2 List of Figures...............................................................................................4 List of Tables ................................................................................................6 Chapter
منابع مشابه
Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems
This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge stored in the case base. KD in CBR is a 2-stage iterative process on both case representation and ...
متن کاملCase-Based Reasoning in Course Timetabling: An Attribute Graph Approach
An earlier Case-based Reasoning (CBR) approach developed by the authors for educational course timetabling problems employed structured cases to represent the complex relationships between courses. The retrieval searches for structurally similar cases in the case base. In this paper, the approach is further developed to solve a wider range of problems. We also attempt to retrieve those cases th...
متن کاملBurke, Edmund and MacCarthy, Bart L. and Petrovic, Sanja and Qu, Rong (2002) Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling. In: International Conference on the Practice and Theory of Automated Timetabling, Aug 2002, Gent Belgium
This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyperheuristics has recently been employed to refer to “heuristics that choose heuristics” rather than heuristics that operate directly on given problems. One of the overriding motivations of hyper-heuristic methods is the attempt to develop techniques that can ope...
متن کاملA Simulated Annealing Hyper-heuristic for University Course Timetabling
The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...
متن کاملCase-based heuristic selection for timetabling problems
This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solvin...
متن کامل